On r-Noncommuting Graph of Finite Rings
نویسندگان
چکیده
Let R be a finite ring and r∈R. The r-noncommuting graph of R, denoted by ΓRr, is simple undirected whose vertex set two vertices x y are adjacent if only [x,y]≠r [x,y]≠−r. In this paper, we obtain expressions for degrees show that ΓRr neither regular nor lollipop noncommutative. We characterize noncommutative rings such tree, in particular star graph. It also shown ΓR1r ΓR2ψ(r) isomorphic R1 R2 isoclinic with isoclinism (ϕ,ψ). Further, consider the induced subgraph ΔRr (induced non-central elements R) results on clique number diameter along certain characterizations n-regular some positive integer n. As applications our results, their noncommuting graphs n≤6.
منابع مشابه
Exact annihilating-ideal graph of commutative rings
The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.
متن کاملThe Intersection Graph of Finite Commutative Principal Ideal Rings
In this article we consider the intersection graph G(R) of nontrivial proper ideals of a finite commutative principal ideal ring R with unity 1. Two distinct ideals are adjacent if they have non-trivial intersection. We characterize when the intersection graph is complete, bipartite, planar, Eulerian or Hamiltonian. We also find a formula to calculate the number of ideals in each ring and the d...
متن کاملConnectivity of the zero-divisor graph for finite rings
The vertex-connectivity and edge-connectivity of the zero-divisor graph associated to a finite commutative ring are studied. It is shown that the edgeconnectivity of ΓR always coincides with the minimum degree. When R is not local, it is shown that the vertex-connectivity also equals the minimum degree, and when R is local, various upper and lower bounds are given for the vertex-connectivity.
متن کاملgroups for which the noncommuting graph is a split graph
the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2021
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms10030233